Associative-commutative reduction orderings
نویسندگان
چکیده
منابع مشابه
Associative-Commutative Reduction Orderings
Rewrite systems are sets of directed equations used to compute by repeatedly replacing subterms in a given expression by equal terms until a simplest form possible (a normal form) is obtained. If a rewrite system is terminating (i.e., allows no infinite sequence of rewrites), then every expression has a normal form. A variety of orderings, called reduction orderings, have been designed for prov...
متن کاملPath Orderings for Termination of Associative-Commutative Rewriting
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," suffices for establishing termination of extended rewriting modulo associativity and commutativity. 1 I n t r o d u c t i o n Rewrite systems find application to various aspects of theorem proving and programming language semantics. The essential idea in rewrit...
متن کاملAssociative-commutative Deduction with Constraints Associative-commutative Deduction with Constraints
Associative-commutative equational reasoning is known to be highly complex for theorem proving. Hence, it is very important to focus deduction by adding constraints, such as uniication and ordering, and to deene eecient strategies, such as the basic requirements a la Hullot. Constraints are formulas used for pruning the set of ground instances of clauses deduced by a theorem prover. We propose ...
متن کاملAssociative-Commutative Deducibility Constraints
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associative and commutative symbols. We show that deciding such Diophantine systems is, in general, undecidable. Then, we consider a simple subclass, which we show decidable. Though the solutions of these problems are not neces...
متن کاملAssociative-Commutative Rewriting
We are currently extending the rewrite system labora tory REVE to handle associative-commutative operators. In particular, we are incorporating a set of rules for Boolean algebra that provides a refutationally-complete theorem prover and a new programming paradigm. To that end, we describe methods for proving termination of associativecommutative systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1992
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90024-p